A remapping scheme for history‐dependent material state variables
نویسندگان
چکیده
منابع مشابه
Scheduled Review Methods for Controllable State Variables
In many real systems in which a state variable should be controlled for being in appropriate range, the length of control (review) intervals is taken to be constant. In such systems, when the cost of reviews and out-of-range values of the state variable are considerable, this method may not be optimal. In this paper we let the length of review intervals to be variable during each operating cycl...
متن کاملAn Incremental Remapping Transport Scheme on a Spherical Geodesic Grid
Weather and climate models contain equations for transporting conserved quantities such as the mass of air, water, ice, and associated tracers. Ideally, the numerical schemes used to solve these equations should be conservative, spatially accurate, and monotonicity-preserving. One such scheme is incremental remapping, previously developed for transport on quadrilateral grids. Here the increment...
متن کاملscheduled review methods for controllable state variables
in many real systems in which a state variable should be controlled for being in appropriate range, the length of control (review) intervals is taken to be constant. in such systems, when the cost of reviews and out-of-range values of the state variable are considerable, this method may not be optimal. in this paper we let the length of review intervals to be variable during each operating cycl...
متن کاملHARD: Host-Level Address Remapping Driver for Solid-State Disk
Recent SSDs use parallel architectures with multi-channel and multiway, and manages multiple pages in a group, called superpage, to reduce the size of address mapping information. Such a coavrse grained mapping provides a poor performance for small sized random write requests. To solve the problem, this paper proposes a novel host-level device driver, called HARD, which merges several small siz...
متن کاملOn Taylor's Scheme for Unbound Variables
A novel scheme for representing unbound variables was proposed by Taylor: that aliased unbound variables are represented as circular chains of cells. Unfortunately, few details were given on its implementation and the involved trade oos. We compare the proposed scheme to that of Warren's abstract machine , and nd that Taylor's scheme (a) leads to increased trailing, (b) makes stack allocation m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2020
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.6350